Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete
نویسنده
چکیده
We prove that maximum three dimensional matching is a MAX SNP-hard problem. If the number of occurrences of elements in triples is bounded by a constant the problem is MAX SNP-complete. As corollaries we prove that maximum covering by 3-sets and maximum covering of a graph by triangles are MAX SNP-hard. The problems are MAX SNP-complete if the number of occurrences of the elements and the degree of the nodes respectively are bounded by a constant.
منابع مشابه
On Multi-dimensional Packing Problems
line and oo-line approximation algorithms for vector covering problems. analysis of algorithms for dual bin packing problems. packing can be solved within 1 + in linear time.gorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses.schatz. Resource scheduling in enhanced pay-per-view continuous media databases. An eecient approximation scheme for the one-dimensi...
متن کاملOn Approximation Properties of the Independent Set Problem for Degree 3 Graphs
The main problem we consider in this paper is the Independent Set problem for bounded degree graphs. It is shown that the problem remainsMAX SNP{complete when the maximum degree is bounded by 3. Some related problems are also shown to be MAX SNP{complete at the lowest possible degree bounds. Next we study better poly{time approximation of the problem for degree 3 graphs, and improve the previou...
متن کاملOn the Approximability of the Maximum Common Subgraph Problem
Some versions of the maximum common subgraph problem are studied and approximation algorithms are given. The maximum bounded common induced subgraph problem is shown to be Max SNP-hard and the maximum unbounded common induced subgraph problem is shown to be as hard to approximate as the maximum independent set problem. The maximum common induced connected subgraph problem is still harder to app...
متن کاملThe b-Matching Problem in Hypergraphs: Hardness and Approximability
In this paper we analyze the maximum cardinality b-matching problem in l-uniform hypergraphs with respect to the complexity class Max-Snp, where b-matching is defined as follows: for given b ∈ N and a hypergraph H = (V, E) a subset Mb ⊆ E with maximum cardinality is sought so that no vertex is contained in more than b hyperedges of Mb. We show that if the maximum degree of the vertices is bound...
متن کاملFinding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs
Comparing genomic properties of multiple species at varying evolutionary distances is a powerful approach for studying biological and evolutionary principles. In the context of comparative analysis of protein-protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex G in the protein-protein interaction graph H of another species with respec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 37 شماره
صفحات -
تاریخ انتشار 1991